International Journal of Advanced Networking and Applications

Shweta Jain ¹, Saurabh Jain ²

Affiliations
1 Pacific Academy of Higher Education and Research University, Udaipur, IN
2 Shri Vaishnav Institute of Computer Applications, Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore, IN

Abstract

Operating System may work on different types of CPU scheduling algorithms with different mechanism and concepts. The Multilevel Feedback Queue (MLFQ) Scheduling manages a variety of processes among various queues in a better and efficient manner. CPU scheduler appears transition mechanism over various queues. This paper is presented with various schemes of under a probability-based model. The scheduler has random movement over queues with given time quantum. This paper designs general transition model for its functioning and justifying comparison under different scheduling schemes through a simulation study applied on different data sets in particular cases.

Keywords

Markov Chain Model, Multi-Level Feedback Queue Scheduling, Process Queue, Process Scheduling, Transition Probability Matrix.

Full Text

   

Shweta Jain ¹, Saurabh Jain ²

Affiliations
1 Department of Computer Applications, Shri R.G.P. Gujarati Professional Institute, Indore-10, IN
2 Institute of Computer Applications, Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore, IN

Abstract

When a process gets the CPU, the scheduler has no idea of the precise amount of CPU time the process will need. Process scheduling algorithms are used for better utilization of CPU. The number of processes arriving to the CPU at a time comes in mass volume which causes a long waiting queue. In Multilevel feedback queue scheduling, the scheduler moves from one queue to another in order to perform the processing follow the transition mechanism. This paper analysed a general transition scenario for the functioning of CPU scheduler in multilevel queue with feedback mechanism. We proposed a Markov chain model to analyze this transition phenomenon with a general class of scheduling scheme. Simulation study is performed to evaluate the comparative study with the help of varying values of α and d in a mathematical model.

Keywords

Markov Chain Model, Multi-Level Feedback Queue Scheduling, Process Queue, Transition Probability Matrix, Wait State.

Full Text

   

Diwakar Shukla ¹, Shweta Ojha ², Saurabh Jain ²

Affiliations
1 Department of Mathematics and Statistics, Sagar University, Sagar-470003, M.P., IN
2 Department of Computer Science & Applications, Sagar University, Sagar-470003, M.P., IN

Abstract

In the uniprocessor environment, the number of jobs arriving at the processor of CPU at a time is very large which causes a long waiting queue. When conflict arises due to shared resources or overlap of instructions or logical error, the deadlock state appears where further processing of jobs is blocked completely. While the scheduler jumps from one job to another in order to perform the processing the transition mechanism appears. This paper presents a general structure of transition scenario for the functioning of CPU scheduler in the presence of deadlock condition in setup of multilevel queue scheduling. A data model based Markov chain model is proposed to study the transition phenomenon and a general class of scheduling scheme is designed. Some specific and well known schemes are treated as its particular cases and are compared under the setup of model through a proposed deadlock-waiting index measure. Simulation study is performed to evaluate the comparative merits of specific schemes belonging to the class designed with the help of varying values of α and d.

Keywords

Process Scheduling, Markov Chain Model, Data Model, State of System, Rest State, Deadlock State, Process Queue, Multi-Level Queue Scheduling, Transition Probability Matrix, Deadlock Index.

Full Text

   

D. Shukla ¹, Saurabh Jain ², Rahul Singhai ², R. K. Agarwal ³

Affiliations
1 Dept. of Mathematics and Statistics, Dr. H.S. Gour University, Sagar-470003 (M.P.), IN
2 Dept. of Comp. and Applications, Dr. H.S. Gour University, Sagar-470003 (M.P.), IN
3 Indira Gandhi Engineering College, Sagar, IN

Abstract

In the literature of Round-Robin scheduling scheme, each job is processed, one after the another after giving a fix quantum. In case of First-come first-served, each process is executed, if the previously arrived processed is completed. Both these scheduling schemes are used in this paper as its special cases. A Markov chain model is used to compare several scheduling schemes of the class. An index measure is defined to compare the model based efficiency of different scheduling schemes. One scheduling scheme which is the mixture of FIFO and round robin is found efficient in terms of model based study. The system simulation procedure is used to derive the conclusion of the content.

Keywords

Process Scheduling, Markov Chain Model, State of System, Deadlock State, Process Queue, First-In First-Out (FIFO), Round-Robin Scheduling, Transition Probability Matrix.

Full Text